Towards First-order Deduction Based on Shannon Graphs
نویسندگان
چکیده
We present a new approach to Automated Deduction based on the concept of Shan-non graphs, which are also known as Binary Decision Diagrams (BDDs). A Skolemized formula is rst transformed into a Shannon graph, then the latter is compiled into a set of Horn clauses. These can nally be run as a Prolog program trying to refute the initial formula. It is also possible to precompile axiomatizations into Prolog and load these theories as required.
منابع مشابه
Automated Deduction with Shannon Graphs
Binary Decision Diagrams (BDDs) are a well-known tool for representing Boolean functions. We show how BDDs can be extended to full rst-order logic by integrating means for representing quantiiers. The resulting structures are called Shannon graphs. A calculus based on these Shannon graphs is set up, and its soundness and completeness proofs are outlined. A comparison of deduction with rst-order...
متن کاملHistory and Prospects for First-Order Automated Deduction
Theorem proving on the computer, using procedures based on the fundamental theorems of Herbrand concerning the first-order predicate calculus, is examined with a view towards improving the efficiency and widening the range of practical applicability of these procedures. A close analysis of the process of substitution (of terms for variables), and the process of truth-functional analysis of the ...
متن کاملInference Graphs: Combining Natural Deduction and Subsumption Inference in a Concurrent Reasoner
There are very few reasoners which combine natural deduction and subsumption reasoning, and there are none which do so while supporting concurrency. Inference Graphs are a graph-based inference mechanism using an expressive first– order logic, capable of subsumption and natural deduction reasoning using concurrency. Evaluation of concurrency characteristics on a combination natural deduction an...
متن کاملQuery Graphs with Cuts: Mathematical Foundations
Query graphs with cuts are inspired by Sowa’s conceptual graphs, which are in turn based on Peirce’s existential graphs. In my thesis ‘The Logic System of Concept Graphs with Negations’, conceptual graphs are elaborated mathematically, and the cuts of existential graphs are added to them. This yields the system of concept graphs with cuts. These graphs correspond to the closed formulas of first...
متن کاملOn the second order first zagreb index
Inspired by the chemical applications of higher-order connectivity index (or Randic index), we consider here the higher-order first Zagreb index of a molecular graph. In this paper, we study the linear regression analysis of the second order first Zagreb index with the entropy and acentric factor of an octane isomers. The linear model, based on the second order first Zag...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1992